Geodetic Hop Dominating Sets in a Graph
نویسندگان
چکیده
Let G be an undirected graph with vertex and edge sets V (G) E(G), respectively. A subset S of vertices is a geodetic hop dominating set if it both set. The domination number G, γhg(G), the minimum cardinality among all in G. Geodetic resulting from some binary operations have been characterized. These characterizations used to determine tight bounds for each graphs considered.
منابع مشابه
Weighted Geodetic Convex Sets in A Graph
Let tt : (V, E, W ) be a finite, connected, weighted graph without loops and multiple edges. In a weighted graph each arc is assigned a weight by the weight function W : E +. A u v path P in tt is called a weighted u v geodesic if the weighted distance between u and v is calculated along P . The strength of a path is the minimum weight of its arcs, and length of a path is the number of edges in...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملDistributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable “shortest path property”. Routing via the backbone created is also discussed. The algorithm has a “constant-time” comp...
متن کاملGeodetic Sets in Graphs
Geodetic sets in graphs are briefly surveyed. After an overview of earlier results, we concentrate on recent studies of the geodetic number and related invariants in graphs. Geodetic sets in Cartesian products of graphs and in median graphs are considered in more detail. Algorithmic issues and relations with several other concepts, arising from various convex and interval structures in graphs, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2023
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v16i1.4646